def EqualNumbers(a):
n = len(a)
for i in range(0, n):
while a[i] % 2 == 0:
a[i] //= 2
while a[i] % 3 == 0:
a[i] //= 3
if a[i] != a[0]:
return print("No")
return print("Yes")
def main():
n = int(input())
a = list(map(int, input().split()))
EqualNumbers(a)
main()
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
long long a[n];
for(int i=0;i<n;i++){
cin>>a[i];
while(a[i]%3==0){
a[i]/=3;
}
while(a[i]%2==0){
a[i]/=2;
}
}
int flag=0;
for(int i=0;i<n-1;i++){
if(a[i]!=a[i+1]){
flag=1;
cout<<"No";
goto end;
}
}
if(flag==0){
cout<<"Yes";
}
end:
return 0;
}
Lift queries | Goki and his breakup |
Ali and Helping innocent people | Book of Potion making |
Duration | Birthday Party |
e-maze-in | Bricks Game |
Char Sum | Two Strings |
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |